Quasi-deterministic 5' -> 3' Watson-Crick Automata

Watson-Crick (WK) finite automata are working on a tape, that is, DNA molecule. A double stranded molecule contains two strands, each having 5' and 3' end, these strands together form the with following properties. The have same length, their to directions opposite, in position, nucleotides complement of other (by complementary relation). Consequently, WK reading heads, one for strand. In traditional both heads read whole input physical direction, but 5'->3' start from extremes opposite direction. sensing automata, process is finished when meet, model capable accept class linear context-free languages. Deterministic variants weaker, named 2detLIN, proper subclass languages accepted by them. Recently, another specific variants, state-deterministic investigated which graph automaton has special property node graph, all out edges (if any) go sole node, i.e., state there (at most) can be reached direct transition. It was shown this concept somewhat orthogonal usual determinism case automata. paper new concept, quasi-determinism investigated, configuration computation it not yet), next uniquely determined although may be, various transitions enabled at time. We show common generalisation state-determinism, quasi-deterministic superclass mentioned classes. There restrictions e.g., stateless or 1-limited variants. also prove some hierarchy results among language classes subclasses already known